Optimal Coding Subgraph Selection under Survivability Constraint

نویسندگان

  • Fouladi, A. Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Gavazang Road, Zanjan, Iran.
  • Khodayifar, S. Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Gavazang Road, Zanjan, Iran.
  • Raayatpanah, M. A. Department of Mathematics, Kharazmi University,Tehran, Iran
چکیده مقاله:

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets received on their incoming edges. Also, in communication network, the extensive use of high capacity physical media like fiber increases the potential damage to network services due to failures in links or nodes (cable cuts, electronic failures on switching centers, etc.). Since quality of service has become a competitive advantage for services in the industry, planners are looking for end-to-end survivable designs that are robust with respect to failure in network components. Survivability is considered as a fraction of the demand that can still be satisfied after each failure scenario. In this paper, attempt has been made to select minimum-cost coding sub-graphs in a single or multiple multicasts over coded packet networks under survivability constraint. First, mathematical optimization models are presented for the problem. Then, the proposed model is solved by using Lagrangian relaxation method. Finally, the efficiency of the proposed model is evaluated through simulation results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Genetic View Selection Algorithm Under Space Constraint

Materialized view selection problem is one of the most important decisions in designing a data warehouse. In order to efficiently solve the problem, a modified genetic algorithm for how to select a set of views to be materialized so as to achieve both good query performance and low view maintenance cost under a storage space constraint is proposed. The essential idea of the algorithm is as foll...

متن کامل

Optimal Design of Geometrically Nonlinear Structures Under a Stability Constraint

This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...

متن کامل

Optimal Control under a Dynamic Fuel Constraint

We present a new approach to solve optimal control problems of the monotone follower type. The key feature of our approach is that it allows to include an arbitrary dynamic fuel constraint. Instead of dynamic programming, we use the convexity of our cost functional to derive a first order characterization of optimal policies based on the Snell envelope of the objective functional’s gradient at ...

متن کامل

Feature Selection for Classification under Anonymity Constraint

Over the last decade, proliferation of various online platforms and their increasing adoption by billions of users have heightened the privacy risk of a user enormously. In fact, security researchers have shown that sparse microdata containing information about online activities of a user although anonymous, can still be used to disclose the identity of the user by cross-referencing the data wi...

متن کامل

Optimal Shape Coding under Buffer Constraints

In this paper, we consider an optimal rate control algorithm for shape coding of emerging MPEG-4 compression system. Current MPEG-4 shape coding consists of two sub-steps; First distortion is introduced by scaling down and up way. Then, second, context-based arithmetic coding is applied. Since the arithmetic coding is \lossless", scaling down and up step is considered as a virtual quantizer. We...

متن کامل

Optimal Linear Joint Source-Channel Coding with Delay Constraint

The problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay constraint. It is shown that, under the mean-square error distortion metric, an optimal encoder-decoder pair from the linear and time-invariant (LTI) class can be fou...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 16  شماره 1

صفحات  11- 28

تاریخ انتشار 2019-04

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

کلمات کلیدی برای این مقاله ارائه نشده است

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023